A Machine-Independent Characterization of Timed Languages
نویسندگان
چکیده
We use a variant of Fraenkel-Mostowski sets (known also as nominal sets) as a framework suitable for stating and proving the following two results on timed automata. The first result is a machineindependent characterization of languages of deterministic timed automata. As a second result we define a class of automata, called by us timed register automata, that extends timed automata and is effectively closed under minimization.
منابع مشابه
An Algebraic Characterization of Data and Timed Languages
Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce the notion of monoid recognizability for data languages, which include timed languages as special case, in a way that respects the spirit of the classical situation. We study closure properties and h...
متن کاملOn Timed Automata with Discrete Time - Structural and Language Theoretical Characterization
We develop a structural and language theoretical characterization of timed languages over discrete time in terms of a variant of Büchi automata and languages. The so-called tick automaton is a standard Büchi automaton with a special “clock-tick”-input symbol modeling the discrete flow of time. Based on these characterizations we give an alternative proof for the fact that the class of regular t...
متن کاملTimed Transition Activation Semantics in Statecharts
We propose an intuitive semantics for timed transition activation in hierarchical state machine languages like UML Statecharts or Harel Statecharts. The semantics presented here explain precisely when the timer implicitly associated with a timed transition is activated, and possibly deactivated, during a machine’s execution. In addition to the semantics, a decision procedure is given which serv...
متن کاملAn algebraic approach to data languages and timed languages
Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce the notion of monoid recognizability for data languages, which include timed languages as special case, in a way that respects the spirit of the classical situation. We study closure properties and h...
متن کاملOn a simplified untiming procedure for supervisory control of timed automata when the time increases strictly monotonically
Given a timed automaton G accepting the timed language L a finite state machine G 0 can be constructed, known as the region automaton, which accepts the untimed language Untime (L). In this paper we construct an alternative finite state machine which also accepts the language Untime (L), but has fewer states than G 0. This is shown for languages of both finite and infinite traces given that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012